0.08/0.09 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.08/0.10 % Command : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC 0.09/0.30 % Computer : n025.cluster.edu 0.09/0.30 % Model : x86_64 x86_64 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.09/0.30 % Memory : 8042.1875MB 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64 0.09/0.30 % CPULimit : 1200 0.09/0.30 % WCLimit : 120 0.09/0.30 % DateTime : Tue Jul 13 16:11:57 EDT 2021 0.09/0.30 % CPUTime : 0.09/0.30 % Number of cores: 8 0.09/0.30 % Python version: Python 3.6.8 0.09/0.30 # Version: 2.6rc1-ho 0.09/0.31 # No SInE strategy applied 0.09/0.31 # Trying AutoSched0 for 59 seconds 5.67/5.88 # AutoSched0-Mode selected heuristic G_E___208_C18AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN 5.67/5.88 # and selection function SelectComplexExceptUniqMaxHorn. 5.67/5.88 # 5.67/5.88 # Preprocessing time : 0.028 s 5.67/5.88 # Presaturation interreduction done 5.67/5.88 5.67/5.88 # Proof found! 5.67/5.88 # SZS status Theorem 5.67/5.88 # SZS output start CNFRefutation 5.67/5.88 thf(two_ax, axiom, (two)=(^[X1:$i > $i, X2:$i]:X1 @ (X1 @ X2)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM006^0.ax', two_ax)). 5.67/5.88 thf(succ_ax, axiom, (succ)=(^[X3:($i > $i) > $i > $i, X1:$i > $i, X2:$i]:X1 @ (X3 @ X1 @ X2)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM006^0.ax', succ_ax)). 5.67/5.88 thf(thm, conjecture, ?[X5:(($i > $i) > $i > $i) > (($i > $i) > $i > $i) > ($i > $i) > $i > $i]:((X5 @ two @ three)=(five)&(X5 @ one @ two)=(three)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', thm)). 5.67/5.88 thf(three_ax, axiom, (three)=(^[X1:$i > $i, X2:$i]:X1 @ (X1 @ (X1 @ X2))), file('/export/starexec/sandbox2/benchmark/Axioms/NUM006^0.ax', three_ax)). 5.67/5.88 thf(one_ax, axiom, (one)=(^[X1:$i > $i, X2:$i]:X1 @ X2), file('/export/starexec/sandbox2/benchmark/Axioms/NUM006^0.ax', one_ax)). 5.67/5.88 thf(plus_ax, axiom, (plus)=(^[X4:($i > $i) > $i > $i, X3:($i > $i) > $i > $i, X1:$i > $i, X2:$i]:X4 @ X1 @ (X3 @ X1 @ X2)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM006^0.ax', plus_ax)). 5.67/5.88 thf(zero_ax, axiom, (zero)=(^[X1:$i > $i, X2:$i]:X2), file('/export/starexec/sandbox2/benchmark/Axioms/NUM006^0.ax', zero_ax)). 5.67/5.88 thf(five_ax, axiom, (five)=(^[X1:$i > $i, X2:$i]:X1 @ (X1 @ (X1 @ (X1 @ (X1 @ X2))))), file('/export/starexec/sandbox2/benchmark/Axioms/NUM006^0.ax', five_ax)). 5.67/5.88 thf(c_0_8, plain, ![X1:$i > $i, X2:$i]:(two @ X1 @ X2)=(X1 @ (X1 @ X2)), inference(fof_simplification,[status(thm)],[two_ax])). 5.67/5.88 thf(c_0_9, plain, ![X3:($i > $i) > $i > $i, X1:$i > $i, X2:$i]:(succ @ X3 @ X1 @ X2)=(X1 @ (X3 @ X1 @ X2)), inference(fof_simplification,[status(thm)],[succ_ax])). 5.67/5.88 thf(c_0_10, negated_conjecture, ~(?[X5:(($i > $i) > $i > $i) > (($i > $i) > $i > $i) > ($i > $i) > $i > $i]:((X5 @ two @ three)=(five)&(X5 @ one @ two)=(three))), inference(assume_negation,[status(cth)],[thm])). 5.67/5.88 thf(c_0_11, plain, ![X1:$i > $i, X2:$i]:(three @ X1 @ X2)=(X1 @ (X1 @ (X1 @ X2))), inference(fof_simplification,[status(thm)],[three_ax])). 5.67/5.88 thf(c_0_12, plain, ![X11:$i > $i, X12:$i]:(two @ X11 @ X12)=(X11 @ (X11 @ X12)), inference(variable_rename,[status(thm)],[c_0_8])). 5.67/5.88 thf(c_0_13, plain, ![X29:($i > $i) > $i > $i, X30:$i > $i, X31:$i]:(succ @ X29 @ X30 @ X31)=(X30 @ (X29 @ X30 @ X31)), inference(variable_rename,[status(thm)],[c_0_9])). 5.67/5.88 thf(c_0_14, negated_conjecture, ![X40:(($i > $i) > $i > $i) > (($i > $i) > $i > $i) > ($i > $i) > $i > $i]:((X40 @ two @ three)!=(five)|(X40 @ one @ two)!=(three)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])). 5.67/5.88 thf(c_0_15, plain, ![X1:$i > $i, X2:$i]:(one @ X1 @ X2)=(X1 @ X2), inference(fof_simplification,[status(thm)],[one_ax])). 5.67/5.88 thf(c_0_16, plain, ![X4:($i > $i) > $i > $i, X3:($i > $i) > $i > $i, X1:$i > $i, X2:$i]:(plus @ X4 @ X3 @ X1 @ X2)=(X4 @ X1 @ (X3 @ X1 @ X2)), inference(fof_simplification,[status(thm)],[plus_ax])). 5.67/5.88 thf(c_0_17, plain, ![X13:$i > $i, X14:$i]:(three @ X13 @ X14)=(X13 @ (X13 @ (X13 @ X14))), inference(variable_rename,[status(thm)],[c_0_11])). 5.67/5.88 thf(c_0_18, plain, ![X1:$i > $i, X2:$i]:(two @ X1 @ X2)=(X1 @ (X1 @ X2)), inference(split_conjunct,[status(thm)],[c_0_12])). 5.67/5.88 thf(c_0_19, plain, ![X1:$i > $i, X3:($i > $i) > $i > $i, X2:$i]:(succ @ X3 @ X1 @ X2)=(X1 @ (X3 @ X1 @ X2)), inference(split_conjunct,[status(thm)],[c_0_13])). 5.67/5.88 thf(c_0_20, plain, ![X1:$i > $i, X2:$i]:(zero @ X1 @ X2)=(X2), inference(fof_simplification,[status(thm)],[zero_ax])). 5.67/5.88 thf(c_0_21, negated_conjecture, ![X5:(($i > $i) > $i > $i) > (($i > $i) > $i > $i) > ($i > $i) > $i > $i]:((X5 @ two @ three)!=(five)|(X5 @ one @ two)!=(three)), inference(split_conjunct,[status(thm)],[c_0_14])). 5.67/5.88 thf(c_0_22, plain, ![X9:$i > $i, X10:$i]:(one @ X9 @ X10)=(X9 @ X10), inference(variable_rename,[status(thm)],[c_0_15])). 5.67/5.88 thf(c_0_23, plain, ![X32:($i > $i) > $i > $i, X33:($i > $i) > $i > $i, X34:$i > $i, X35:$i]:(plus @ X32 @ X33 @ X34 @ X35)=(X32 @ X34 @ (X33 @ X34 @ X35)), inference(variable_rename,[status(thm)],[c_0_16])). 5.67/5.88 thf(c_0_24, plain, ![X1:$i > $i, X2:$i]:(three @ X1 @ X2)=(X1 @ (X1 @ (X1 @ X2))), inference(split_conjunct,[status(thm)],[c_0_17])). 5.67/5.88 thf(c_0_25, plain, ![X1:$i > $i, X3:($i > $i) > $i > $i, X2:$i]:(X1 @ (succ @ X3 @ X1 @ X2))=(two @ X1 @ (X3 @ X1 @ X2)), inference(spm,[status(thm)],[c_0_18, c_0_19])). 5.67/5.88 thf(c_0_26, plain, ![X7:$i > $i, X8:$i]:(zero @ X7 @ X8)=(X8), inference(variable_rename,[status(thm)],[c_0_20])). 5.67/5.88 thf(c_0_27, negated_conjecture, ![X5:(($i > $i) > $i > $i) > (($i > $i) > $i > $i) > ($i > $i) > $i > $i]:((X5 @ one @ two @ (esk1_2 @ X5))!=(three @ (esk1_2 @ X5))|(X5 @ two @ three)!=(five)), inference(neg_ext,[status(thm)],[c_0_21])). 5.67/5.88 thf(c_0_28, plain, ![X1:$i > $i, X2:$i]:(one @ X1 @ X2)=(X1 @ X2), inference(split_conjunct,[status(thm)],[c_0_22])). 5.67/5.88 thf(c_0_29, plain, ![X1:$i > $i, X3:($i > $i) > $i > $i, X4:($i > $i) > $i > $i, X2:$i]:(plus @ X3 @ X4 @ X1 @ X2)=(X3 @ X1 @ (X4 @ X1 @ X2)), inference(split_conjunct,[status(thm)],[c_0_23])). 5.67/5.88 thf(c_0_30, plain, ![X1:$i > $i, X3:($i > $i) > $i > $i, X2:$i]:(X1 @ (two @ X1 @ (X3 @ X1 @ X2)))=(three @ X1 @ (X3 @ X1 @ X2)), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24, c_0_19]), c_0_25])). 5.67/5.88 thf(c_0_31, plain, ![X1:$i > $i, X2:$i]:(zero @ X1 @ X2)=(X2), inference(split_conjunct,[status(thm)],[c_0_26])). 5.67/5.88 thf(c_0_32, plain, ![X1:$i > $i, X2:$i]:(five @ X1 @ X2)=(X1 @ (X1 @ (X1 @ (X1 @ (X1 @ X2))))), inference(fof_simplification,[status(thm)],[five_ax])). 5.67/5.88 thf(c_0_33, negated_conjecture, ![X5:(($i > $i) > $i > $i) > (($i > $i) > $i > $i) > ($i > $i) > $i > $i]:((X5 @ one @ two @ (esk1_2 @ X5) @ (esk5_1 @ X5))!=(three @ (esk1_2 @ X5) @ (esk5_1 @ X5))|(X5 @ two @ three)!=(five)), inference(neg_ext,[status(thm)],[c_0_27])). 5.67/5.88 thf(c_0_34, plain, ![X1:$i > $i, X3:($i > $i) > $i > $i, X2:$i]:(plus @ one @ X3 @ X1 @ X2)=(X1 @ (X3 @ X1 @ X2)), inference(spm,[status(thm)],[c_0_28, c_0_29])). 5.67/5.88 thf(c_0_35, plain, ![X1:$i > $i, X2:$i]:(X1 @ (two @ X1 @ X2))=(three @ X1 @ X2), inference(spm,[status(thm)],[c_0_30, c_0_31])). 5.67/5.88 thf(c_0_36, plain, ![X17:$i > $i, X18:$i]:(five @ X17 @ X18)=(X17 @ (X17 @ (X17 @ (X17 @ (X17 @ X18))))), inference(variable_rename,[status(thm)],[c_0_32])). 5.67/5.88 thf(c_0_37, negated_conjecture, (plus @ two @ three)!=(five), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33, c_0_34]), c_0_35])])). 5.67/5.88 thf(c_0_38, plain, ![X1:$i > $i, X3:($i > $i) > $i > $i, X2:$i]:(plus @ two @ X3 @ X1 @ X2)=(X1 @ (X1 @ (X3 @ X1 @ X2))), inference(spm,[status(thm)],[c_0_18, c_0_29])). 5.67/5.88 thf(c_0_39, plain, ![X1:$i > $i, X2:$i]:(five @ X1 @ X2)=(X1 @ (X1 @ (X1 @ (X1 @ (X1 @ X2))))), inference(split_conjunct,[status(thm)],[c_0_36])). 5.67/5.88 thf(c_0_40, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(neg_ext,[status(thm)],[c_0_37]), c_0_38]), c_0_24]), c_0_39])]), ['proof']). 5.67/5.88 # SZS output end CNFRefutation 5.67/5.88 # Proof object total steps : 41 5.67/5.88 # Proof object clause steps : 17 5.67/5.88 # Proof object formula steps : 24 5.67/5.88 # Proof object conjectures : 8 5.67/5.88 # Proof object clause conjectures : 5 5.67/5.88 # Proof object formula conjectures : 3 5.67/5.88 # Proof object initial clauses used : 8 5.67/5.88 # Proof object initial formulas used : 8 5.67/5.88 # Proof object generating inferences : 6 5.67/5.88 # Proof object simplifying inferences : 7 5.67/5.88 # Training examples: 0 positive, 0 negative 5.67/5.88 # Parsed axioms : 29 5.67/5.88 # Removed by relevancy pruning/SinE : 0 5.67/5.88 # Initial clauses : 29 5.67/5.88 # Removed in clause preprocessing : 14 5.67/5.88 # Initial clauses in saturation : 15 5.67/5.88 # Processed clauses : 8338 5.67/5.88 # ...of these trivial : 683 5.67/5.88 # ...subsumed : 2421 5.67/5.88 # ...remaining for further processing : 5233 5.67/5.88 # Other redundant clauses eliminated : 27682 5.67/5.88 # Clauses deleted for lack of memory : 0 5.67/5.88 # Backward-subsumed : 197 5.67/5.88 # Backward-rewritten : 705 5.67/5.88 # Generated clauses : 202220 5.67/5.88 # ...of the previous two non-trivial : 165802 5.67/5.88 # Contextual simplify-reflections : 9 5.67/5.88 # Paramodulations : 136361 5.67/5.88 # Factorizations : 0 5.67/5.88 # NegExts : 11948 5.67/5.88 # Equation resolutions : 27683 5.67/5.88 # Propositional unsat checks : 1 5.67/5.88 # Propositional check models : 0 5.67/5.88 # Propositional check unsatisfiable : 0 5.67/5.88 # Propositional clauses : 0 5.67/5.88 # Propositional clauses after purity: 0 5.67/5.88 # Propositional unsat core size : 0 5.67/5.88 # Propositional preprocessing time : 0.000 5.67/5.88 # Propositional encoding time : 0.442 5.67/5.88 # Propositional solver time : 0.166 5.67/5.88 # Success case prop preproc time : 0.000 5.67/5.88 # Success case prop encoding time : 0.000 5.67/5.88 # Success case prop solver time : 0.000 5.67/5.88 # Current number of processed clauses : 4316 5.67/5.88 # Positive orientable unit clauses : 230 5.67/5.88 # Positive unorientable unit clauses: 34 5.67/5.88 # Negative unit clauses : 6 5.67/5.88 # Non-unit-clauses : 4046 5.67/5.88 # Current number of unprocessed clauses: 155985 5.67/5.88 # ...number of literals in the above : 328864 5.67/5.88 # Current number of archived formulas : 0 5.67/5.88 # Current number of archived clauses : 917 5.67/5.88 # Clause-clause subsumption calls (NU) : 7566100 5.67/5.88 # Rec. Clause-clause subsumption calls : 448545 5.67/5.88 # Non-unit clause-clause subsumptions : 2606 5.67/5.88 # Unit Clause-clause subsumption calls : 11294 5.67/5.88 # Rewrite failures with RHS unbound : 0 5.67/5.88 # BW rewrite match attempts : 24798 5.67/5.88 # BW rewrite match successes : 756 5.67/5.88 # Condensation attempts : 0 5.67/5.88 # Condensation successes : 0 5.67/5.88 # Termbank termtop insertions : 6083913 5.67/5.91 5.67/5.91 # ------------------------------------------------- 5.67/5.91 # User time : 5.420 s 5.67/5.91 # System time : 0.176 s 5.67/5.91 # Total time : 5.596 s 5.67/5.91 # Maximum resident set size: 1680 pages 5.67/5.91 EOF